package cn.z2huo.algorithm.greedy.MiniSpanTree;

public class Kruskal {
    static int max = 100;

    // 输出二维数组
    public void printArray(int[][] array) {
        for (int i = 0; i < array.length; i++) {
            for (int j = 0; j < array[i].length; j++) {
                System.out.printf("%4d", array[i][j]);
            }
            System.out.println();
        }
    }

    public static void main(String[] args){
        int[][] mapArray = {
                {0,6,1,5,max,max},
                {6,0,5,max,3,max},
                {1,5,0,5,6,4},
                {5,max,5,0,max,2},
                {max,3,6,max,0,6},
                {max,max,4,2,6,0}
        };

    }
}
